Compact binary relation representations with rich functionality
نویسندگان
چکیده
منابع مشابه
Compact Binary Relation Representations with Rich Functionality
Binary relations are an important abstraction arising in many data representation problems. The data structures proposed so far to represent them support just a few basic operations required to fit one particular application. We identify many of those operations arising in applications and generalize them into a wide set of desirable queries for a binary relation representation. We also identif...
متن کاملCompact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by one single application, and takes only limited advantage of the inherent redundancy of binary relations. We show how to support more general operations efficiently, while taking better advantage of some forms of redun...
متن کاملBoosting Speaker Recognition Performance with Compact Representations
This paper describes a speaker recognition system combination approach in which the compact forms of MAP adapted GMM supervectors are used to boost the performance of a highdimensional supervector-based system or a combination of multiple systems. The compact supervector representations are subjected to a diagonal transformation to emphasize those dimensions that describe significant speaker in...
متن کاملDetecting compact binary coalescences with seedless clustering
Compact binary coalescences are a promising source of gravitational waves for second-generation interferometric gravitational-wave detectors. Although matched filtering is the optimal search method for well-modeled systems, alternative detection strategies can be used to guard against theoretical errors (e.g., involving new physics and/or assumptions about spin or eccentricity) while providing ...
متن کاملCompact representation of Web graphs with extended functionality
The representation of large subsets of the World Wide Web in the form of a directed graph has been extensively used to analyze structure, behavior, and evolution of those so-called Web graphs. However, interesting Web graphs are very large and their classical representations do not fit into the main memory of typical computers, whereas the required graph algorithms perform inefficiently on seco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.10.003